An optimal linear time algorithm for quasi-monotonic segmentation1
نویسندگان
چکیده
منابع مشابه
An LLL-Reduction Algorithm with Quasi-linear Time Complexity1
We devise an algorithm, e L, with the following specifications: It takes as input an arbitrary basis B = (bi)i ∈ Zd×d of a Euclidean lattice L; It computes a basis of L which is reduced for a mild modification of the Lenstra-Lenstra-Lovász reduction; It terminates in time O(dβ + dβ) where β = log max ‖bi‖ (for any ε > 0 and ω is a valid exponent for matrix multiplication). This is the first LLL...
متن کاملAn LLL-reduction algorithm with quasi-linear time complexity
We devise an algorithm, e L, with the following specifications: It takes as input an arbitrary basis B = (bi)i ∈ Zd×d of a Euclidean lattice L; It computes a basis of L which is reduced for a mild modification of the Lenstra-Lenstra-Lovász reduction; It terminates in time O(dβ + dβ) where β = log max ‖bi‖ (for any ε > 0 and ω is a valid exponent for matrix multiplication). This is the first LLL...
متن کاملAN ALGORITHM FOR FINDING THE STABILITY OF LINEAR TIME-INVARIANT SYSTEMS
The purpose of this paper is to show that the ideas and techniques of the classical methods of finding stability, such as the criteria of Leonhard and Nyquist, can be used to derive simple algorithm to verify stability. This is enhanced by evaluating the argument of the characteristic equation of a linear system in the neighbourhood of the origin of the complex plane along the imaginary axis
متن کاملAn optimal policy for deteriorating items with time-proportional deterioration rate and constant and time-dependent linear demand rate
In this paper, an economic order quantity (EOQ) inventory model for a deteriorating item is developed with the following characteristics: (i) The demand rate is deterministic and two-staged, i.e., it is constant in first part of the cycle and linear function of time in the second part. (ii) Deterioration rate is time-proportional. (iii) Shortages are not allowed to occur. The o...
متن کاملAn Optimal Algorithm for Linear Bandits
We provide the first algorithm for online bandit linear optimization whose regret after T rounds is of order √ Td lnN on any finite class X ⊆ R of N actions, and of order d √ T (up to log factors) when X is infinite. These bounds are not improvable in general. The basic idea utilizes tools from convex geometry to construct what is essentially an optimal exploration basis. We also present an app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 2009
ISSN: 0020-7160,1029-0265
DOI: 10.1080/00207160701694153